package com.jinxi.algorithm;

import java.util.HashMap;
import java.util.Map;

public class Test {

    public static void main(String[] args) {

        int i = 1;
        System.out.println(i >>> 2);
        i = 32;
        System.out.println(i >> 2);

        i = 100000;
        System.out.println(i << 2);
//        i = 400000;
    }

    public void test() {


        String str = "abcdefghig";

        Map<Character, Integer> cm = new HashMap<>();

        char[] cs = str.toCharArray();
        for (char c : cs) {
            System.out.println("" + c);
            if (cm.containsKey(c)) {
                System.out.println("true");
            }
            cm.put(c, 1);

        }

//        cm.forEach((k,v) -> System.out.println(k));
    }

}
